package DynamicProgramming;

import java.io.PrintWriter;
import java.util.Scanner;

class Solver1353
{	int s,bound=9;
	int[][] Rs;
	
	public void Input()
	{	Scanner in=new Scanner(System.in);
		s=in.nextInt();
		Rs=new int[bound+1][s+1];
	}
	public void Solve()
	{	for (int i=0;i<=s;i++)
			if (i<=bound)
				Rs[1][i]=1;
			else
				Rs[1][i]=0;
		for (int i=2;i<=bound;i++)
			for (int j=0;j<=s;j++)
			{	int accu=0;
				for (int k=0;k<=bound;k++)
					if (j-k>=0)
						accu+=Rs[i-1][j-k];
					else
						break;
				Rs[i][j]=accu;
			}
	}
	public void Output()
	{	PrintWriter out=new PrintWriter(System.out);
		if (s==1) Rs[bound][s]++;
		out.println(Rs[bound][s]);
		out.flush();
	}
	public void main()
	{	Input();
		Solve();
		Output();
	}
}
public class P1353
{	public static void main(String[] args)
	{	Solver1353 solver=new Solver1353();
		solver.main();
	}
}
